Two row mixed-integer cuts via lifting
نویسندگان
چکیده
Recently Andersen et al. [1], Borozan and Cornuéjols [6] and Cornuéjols and Margot [10] have characterized the extreme valid inequalities of a mixed integer set consisting of two equations with two free integer variables and non-negative continuous variables. These inequalities are either split cuts or intersection cuts derived using maximal lattice-free convex sets. In order to use these inequalities to obtain cuts from two rows of a general simplex tableau, one approach is to extend the system to include all possible non-negative integer variables (giving the two row mixed-integer infinitegroup problem), and to develop lifting functions giving the coefficients of the integer variables in the corresponding inequalities. In this paper, we study the characteristics of these lifting functions. We show that there exists a unique lifting function that yields extreme inequalities when starting from a maximal lattice-free triangle with multiple integer points in the relative interior of one of its sides, or a maximal lattice-free triangle with integral vertices and one integer point in the relative interior of each side. In the other cases (maximal lattice-free triangles with one integer point in the relative interior of each side and non-integral vertices, and maximal lattice-free quadrilaterals), non-unique lifting functions may yield distinct extreme inequalities. For the latter family of triangles, we present sufficient conditions to yield an extreme inequality for the two row mixed-integer infinite-group problem. This text presents research results of the Belgian Program on Interuniversity Poles of Attraction initiated by the Belgian State, Prime Minister’s Office, Science Policy Programming. The scientific responsibility is assumed by the authors. Santanu S. Dey CORE, Université Catholique de Louvain, Belgium E-mail: [email protected] Laurence A. Wolsey CORE and INMA, Université Catholique de Louvain, Belgium E-mail: [email protected] 2 Santanu S. Dey, Laurence A. Wolsey
منابع مشابه
Characterization of the split closure via geometric lifting
We analyze split cuts from the perspective of cut generating functions via geometric lifting. We show that α-cuts, a natural higher-dimensional generalization of the k-cuts of Cornuéjols et al., gives all the split cuts for the mixed-integer corner relaxation. As an immediate consequence we obtain that the k-cuts are equivalent to split cuts for the 1-row mixed-integer relaxation. Further, we s...
متن کاملOn the Practical Strength of Two-Row Tableau Cuts
Following the flurry of recent theoretical work on cutting planes from two-row mixed integer group relaxations of an LP tableau, we report on computational tests to evaluate the strength of two-row cuts based on lattice-free triangles having more than one integer point on one side. A heuristic procedure to generate such triangles (referred to in the literature as “type 2” triangles) is presente...
متن کاملIntersection Cuts for Single Row Corner Relaxations
We consider the problem of generating inequalities that are valid for one-row relaxations of a simplex tableau, with the integrality constraints preserved for one or more non-basic variables. These relaxations are interesting because they can be used to generate cutting planes for general mixed-integer problems. We first consider the case of a single nonbasic integer variable. This relaxation i...
متن کاملComposite lifting of group inequalities and an application to two-row mixing inequalities
Given a valid inequality for the mixed integer infinite group relaxation, a composite lifting approach that combines sequential lifting and use of a fill-in function is proposed that can be used to strengthen this inequality. Properties of this composite lifting such as bounds on the solution of the lifting problem and some necessary conditions for the lifted inequality to be minimal for the mi...
متن کاملTwo dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
In this paper, we study the relationship between 2D lattice-free cuts, the family of cuts obtained by taking two-row relaxations of a mixed-integer program (MIP) and applying intersection cuts based on maximal lattice-free sets in R, and various types of disjunctions. Recently, Li and Richard (2007) studied disjunctive cuts obtained from t-branch split disjunctions of mixed-integer sets (these ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Program.
دوره 124 شماره
صفحات -
تاریخ انتشار 2010